DASH: A Distributed and Parallelizable Algorithm for Size-Constrained Submodular Maximization

نویسندگان

چکیده

MapReduce (MR) algorithms for maximizing monotone, submodular functions subject to a cardinality constraint (SMCC) are currently restricted the use of linear-adaptive (non-parallelizable) algorithm GREEDY. Low-adaptive do not satisfy requirements these distributed MR frameworks, thereby limiting their performance. We study SMCC problem in setting and propose first with sublinear adaptive complexity. Our algorithms, R-DASH, T-DASH G-DASH provide 0.316 - ε, 3/8 ε , (1 1/e ε) approximation ratios, respectively, nearly optimal complexity linear time Additionally, we framework increase, under some mild assumptions, maximum permissible from O( n / ℓ^2) prior ℓ ), where is data size number machines; stronger condition on objective function, increase value n. Finally, empirical evidence demonstrate that our sublinear-adaptive, orders magnitude faster runtime compared current state-of-the-art algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Submodular Maximization

Many large-scale machine learning problems – clustering, non-parametric learning, kernel machines, etc. – require selecting a small yet representative subset from a large dataset. Such problems can often be reduced to maximizing a submodular set function subject to various constraints. Classical approaches to submodular optimization require centralized access to the full dataset, which is impra...

متن کامل

Interleaved Algorithms for Constrained Submodular Function Maximization

We present a combinatorial algorithm that improves the best known approximation ratio for monotone submodular maximization under a knapsack and a matroid constraint to 1−e −2 2 . This classic problem is known to be hard to approximate within factor better than 1− 1/e. We show that the algorithm can be extended to yield a ratio of 1−e −(k+1) k+1 for the problem with a single knapsack and the int...

متن کامل

Constrained Maximization of Non-Monotone Submodular Functions

The problem of constrained submodular maximization has long been studied, with near-optimal results known under a variety of constraints when the submodular function is monotone. The case of nonmonotone submodular maximization is not as well understood: the first approximation algorithms even for unconstrainted maximization were given by Feige et al. [FMV07]. More recently, Lee et al. [LMNS09] ...

متن کامل

Fast Constrained Submodular Maximization: Personalized Data Summarization

Can we summarize multi-category data based on user preferences in a scalable manner? Many utility functions used for data summarization satisfy submodularity, a natural diminishing returns property. We cast personalized data summarization as an instance of a general submodular maximization problem subject to multiple constraints. We develop the first practical and FAst coNsTrained submOdular Ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i4.25508